- 迭代解
- solution: n. 1.溶解；溶液，溶體，溶劑。 2.(補輪胎用的)橡 ...
- iteration: 迭代疊代疊接; 迭代法; 迭接; 疊代法; 反覆；反覆運作; 反復; 累接法; 替換頁（部分）; 循環(huán); 重復激活流程; 重講; 逐步逼近法; 逐次漸近法
- iteration iteration: 迭代
- block iteration: 塊迭代
- calculation by iteration: 迭代法計算; 疊帶法計算
下載手機詞典可隨時隨地查詞查翻譯
iteration solution中文什么意思
- 迭代解
下載手機詞典可隨時隨地查詞查翻譯
例句與用法
- Fourthly , because of the fluctuation of grouping efficacy during the fcm iteration process , the iteration solution selecting procedure is put forward , with which the infeasible solution of last iteration will not be selected . 5
第四，針對fcm迭代過程中制造單元構(gòu)建方案成組效率的波動性，提出了迭代方案選擇方法，基本避免了fcm選擇的最終迭代方案不可行的問題。 - The increment - iteration solution strategy is adopted in the nonlinear finite element analysis . arc - length method and the incremental plastic reversibility procedure are used to find the complete load - deflection curve and deal with elastic unloading occurring in elasto - plastic analysis
有限元分析中采用增量?迭代方法，結(jié)合弧長法和塑性增量可逆的假定，可以計算出完整的荷載位移曲線，并考慮彈塑性問題中可能出現(xiàn)的彈性卸載問題。 - In this dissertation , we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks . we give five solutions to dirichlet problem in two dimensions ; among these five solutions , we prove that the iteration solution and the solution of relaxations are exponential convergence , then we estimate their respective convergence rates ; secondly , we discuss random walks on general networks , prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly , we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b , making va = 1 and vb = 0 , the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore , we study the relationship between effective resistance and escape probability : starting at a , the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance
本文證明了任何邊值的dirichlet問題都可轉(zhuǎn)化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數(shù)收斂的，并分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加于a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發(fā)，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發(fā)，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。